Factorization of Block Triangular Matrix Functions with Off-diagonal Binomials
نویسندگان
چکیده
Factorizations of Wiener–Hopf type are considered in the abstract framework of Wiener algebras of matrix-valued functions on connected compact abelian groups, with a non-archimedean linear order on the dual group. A criterion for factorizability is established for 2 × 2 block triangular matrix functions with elementary functions on the main diagonal and a binomial expression in the off-diagonal block. Mathematics Subject Classification (2000). Primary 47A68. Secondary 43A17.
منابع مشابه
Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices
We call a matrix triadic if it has no more than two nonzero off-diagonal elements in any column. A symmetric tridiagonal matrix is a special case. In this paper we consider LXLT factorizations of symmetric triadic matrices, where L is unit lower triangular and X is diagonal, block diagonal with 1×1 and 2×2 blocks, or the identity with L lower triangular. We prove that with diagonal pivoting, th...
متن کاملSymmetric indefinite triangular factorization revealing the rank profile matrix
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization PAP = LDL where P is a permutation matrix, L is lower triangular with a unit diagonal and D is symmetric block diagonal with 1×1 and 2×2 antidiagonal blocks. The novel algorithm requires O(n2rω−2) arithmetic o...
متن کاملON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION
The matrix functions appear in several applications in engineering and sciences. The computation of these functions almost involved complicated theory. Thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. The aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. More...
متن کاملRobust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A ≈ RTR up to any desired accuracy, where R is an upper triangular hierarchically semiseparable (HSS) matrix. The factorization is stable, robust, and efficient. The method compresses off-diagonal blocks with rank-revealing orthogonal decompositions. In the meantime, positive semidefinite te...
متن کاملDecoupled Block-Wise ILU(k) Preconditioner on GPU
This research investigates the implementation mechanism of block-wise ILU(k) preconditioner on GPU. The block-wise ILU(k) algorithm requires both the level k and the block size to be designed as variables. A decoupled ILU(k) algorithm consists of a symbolic phase and a factorization phase. In the symbolic phase, a ILU(k) nonzero pattern is established from the point-wise structure extracted fro...
متن کامل